Rook-drawings of Plane Graphs
نویسندگان
چکیده
We introduce a new type of graph drawing called “rook-drawing”. A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a linear algorithm to compute a planar straight-line rook-drawing for outerplanar graphs. We then characterize the maximal planar graphs admitting a planar straight-line rook-drawing, which are unique for a given order. Finally, we give a linear time algorithm to compute a polyline planar rook-drawing for plane graphs with at most n− 3 bent edges. Submitted: November 2015 Reviewed: April 2016 Revised: May 2016 Accepted: August 2016 Final: September 2016 Published: Article type: Regular Paper Communicated by: E. Di Giacomo and A. Lubiw This work has been carried out as part of the “REQUEST” project (PIAO18062-645401) supported by the French “Investissement d’Avenir” Program (Big Data Cloud Computing topic) and has been supported by ANR grant JCJC EGOS ANR-12-JS02-002-01 E-mail addresses: [email protected] (David Auber) [email protected] (Nicolas Bonichon) [email protected] (Paul Dorbec) [email protected] (Claire Pennarun) JGAA, 0(0) 0–0 (0) 1
منابع مشابه
Really Straight Graph Drawings
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes, and that every cubic 3-connected plane graph has a plane drawing with ...
متن کاملar X iv : c s / 04 05 11 2 v 1 [ cs . D M ] 3 1 M ay 2 00 4 Really Straight Graph Drawings ∗
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing ...
متن کاملar X iv : c s . D M / 0 40 51 12 v 1 3 1 M ay 2 00 4 Really Straight Graph Drawings ∗
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing ...
متن کاملGraph Drawings with Relative Edge Length Specifications
We study plane straight-line embeddings of graphs where certain edges are specified to be longer than other edges. We analyze which graphs are universal in the sense that they allow a plane embedding for any total, strict order on the edge lengths. In addition, we also briefly consider circular arc drawings with relative edge length specifications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 21 شماره
صفحات -
تاریخ انتشار 2017